FOR S ENTENCE U NIT S EGMENTATION FROM S PEECH Sébastien Cuendet
نویسنده
چکیده
The sentence segmentation task is a classification task that aims at inserting sentence boundaries in a sequence of words. One of the applications of sentence segmentation is to detect the sentence boundaries in the sequence of words that is output by an automatic speech recognition system (ASR). The purpose of correctly finding the sentence boundaries in ASR transcriptions is to make it possible to use further processing tasks, such as automatic summarization, machine translation, and information extraction. Being a classification task, sentence segmentation requires training data. To reduce the labor-intensive labeling task, available labeled data can be used to train the classifier. The high variability of speech among the various speech styles makes it inefficient to use the classifier from one speech style (designated as out-of-domain) to detect sentence boundaries on another speech style (in-domain) and thus, makes it necessary for one classifier to be adapted before it is used on another speech style. In this work, we first justify the need for adapting data among the broadcast news, conversational telephone and meeting speech styles. We then propose methods to adapt sentence segmentation models trained on conversational telephone speech to meeting conversations style. Our results show that using the model adapted from the telephone conversations, instead of the model trained only on meetings conversation style, significantly improves the performance of the sentence segmentation. Moreover, this improvement holds independently from the amount of in-domain data used. In addition, we also study the differences between speech styles, with statistical measures and by examining the performances of various subsets of features. Focusing on broadcast news and meeting speech style, we show that on the meeting speech style, lexical features are more correlated with the sentence boundaries than the prosodic features, whereas it is the contrary on the broadcast news. Furthermore, we observe that prosodic features are more independent from the speech style than lexical features.
منابع مشابه
Instructions for Preparing Camera-Ready Summaries for SSDM'98
The optical charge pumping method (OCPM) for extracting the spatial distribution of the interface state density (Nit) is proposed. By combining the concept of local threshold voltage in CPM and the drain current generated by the trapped electrons excited from the interface states to the conduction band by incident photons, the Nit is successfully extracted in the SONOS-type flash memory cell tr...
متن کاملW Orking M Emory and S Entence P Rocessing . T He R Oles of R Eferentiality , S Tructure and M Odality
متن کامل
Decentralized Cooperation between a Terrain Aided Mobile Robot and Rotary-Wing Aerial Robot for Exploration: An Approach
D.N. Ray Surface Robotics Lab, CSIR-CMERI, Durgapur-713209, [email protected] U.S. Patkar Surface Robotics Lab, CSIR-CMERI,Durgapur-713209, [email protected] S. Majumder Surface Robotics Lab, CSIR-CMERI,Durgapur-713209, [email protected] M. Majumder Department of Mechanical Engineering, NIT,Durgapur-713209, [email protected] 1 Decentralized Cooperation between a Terrain Aided Mobil...
متن کامل3 D Reconstruction of Manufactured Parts using a Bi-directional Stereovision-based Contour Matching and Comparison of Real and Synthetic Images
Aïcha Beya F AR L SIIT ( U M R U L P-C N R S 7005) U niversité L ouis Pasteur Bd Sébastien Brant, BP 10413 F -67412 Illkirch-C edex , F rance far@ lsiit.u-strasbg.fr Sophie K O H L E R L SIIT ( U M R U L P-C N R S 7005) U niversité L ouis Pasteur Bd Sébastien Brant, BP 10413 F -67412 Illkirch-C edex , F rance kohler@ lsiit.u-strasbg.fr E rnest H IR SC H L SIIT ( U M R U L P-C N R S 7005) U nive...
متن کاملOn exponential domination and graph operations
An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....
متن کامل